منابع مشابه
Obstructions to Weak Decomposability for Simplicial Polytopes
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee provided the first examples of simplicial polytopes that are not weakly vertex-decomposable. These polytopes are polar to certain simple transportation poly...
متن کاملDecomposability of Polytopes
We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We apply it to give new sufficient conditions for indecomposability of polytopes, and then illustrate them with some examples.
متن کاملOn Conditional Decomposability
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to exte...
متن کاملDecomposability of Multivariate Interactions
Naoki Miyagawa1,2 Hiroshi Teramoto1,3 Chun-Biu Li1,2,4 Tamiki Komatsuzaki1,3,4 1Research Institute for Electronic Science Hokkaido University, Sapporo 001-0020, Japan 2Department of Mathematics Hokkaido University, Sapporo 060-0810, Japan 3Graduate School of Life Science Hokkaido University, Sapporo 060-0810, Japan 4Research Center for Integrative Mathematics Hokkaido University, Sapporo 060-08...
متن کاملOn Decomposability of Multilinear Sets
We consider the Multilinear set S defined as the set of binary points (x, y) satisfying a collection of multilinear equations of the form yI = ∏ i∈I xi, I ∈ I, where I denotes a family of subsets of {1, . . . , n} of cardinality at least two. Such sets appear in factorable reformulations of many types of nonconvex optimization problems, including binary polynomial optimization. A great simplifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software for Algebra and Geometry
سال: 2010
ISSN: 1948-7916,1948-7916
DOI: 10.2140/jsag.2010.2.20